Perfect Matching Covers of Cubic Graphs of Oddness 2
نویسندگان
چکیده
منابع مشابه
Double covers of cubic graphs with oddness 4
We prove that a cubic 2-connected graph which has a 2-factor containing exactly 4 odd cycles has a cycle double cover. © 2004 Elsevier Inc. All rights reserved. MSC: 05C38; 05C40; 05C70
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملOn the perfect matching index of bridgeless cubic graphs
If G is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings M1, . . . ,M6 of G with the property that every edge of G is contained in exactly two of them and Berge conjectured that its edge set can be covered by 5 perfect matchings. We define τ(G) as the least number of perfect matchings allowing to cover the edge set of a bridgeless cubic graph and we study thi...
متن کاملA New NCAlgorithm for Perfect Matching in Bipartite Cubic Graphs
The purpose of this paper is to introduce a new approach to the problem of computing perfect matchings in fast deterministic parallel time. In particular, this approach yields a new algorithm which finds a perfect matching in bipartite cubic graphs in time O log n and O n n logn processors in the arbitrary CRCW PRAM model.
متن کاملWeak oddness as an approximation of oddness and resistance in cubic graphs
We introduce weak oddness ωw, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph G, %(G) ≤ ωw(G) ≤ ω(G), where %(G) denotes the resistance of G and ω(G) denotes the oddness of G, so this new measure is an approximation of both oddness and resistance. We demonstrate that there are graphs G satisfying...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/7175